package leetcode.秋招.腾讯.第二次;

import org.omg.PortableInterceptor.INACTIVE;

import java.util.ArrayList;
import java.util.Scanner;
import java.util.Stack;

/**
 * @author ：zsy
 * @date ：Created 2021/9/26 20:18
 * @description：
 */
public class Main1 {
    private static char[] chars = {'+', 'x', '@'};
    public static void main(String[] args) {
        Scanner in = new Scanner(System.in);
        String str = in.next();
        Stack<Long> nums = new Stack<>();
        Stack<Integer> operas = new Stack<>();
        while (true) {
            ArrayList<Integer> list = new ArrayList<>();
            int sum = 0;
            for (int i = 0; i < chars.length; i++) {
                int index = str.indexOf(chars[i]);
                if (index != -1) {
                    list.add(index);
                } else {
                    sum += index;
                }
            }
            if (sum == -2) {

            }

        }
    }
}
